A Geometric Relaxation Solver for Parametric Constraint-Based Models
نویسندگان
چکیده
In this paper, a new relaxation algorithm for solving geometric constraint-based models is proposed. The algorithm starts from a constructive symbolic representation of objects (Constructive Parametric Solid Model, CPSM) and proceeds by iterative relaxation of the geometric constraints. Models that can be reduced to distance and angle constraints can be handled. A new algorithm based on an iterative global deformation of the system is presented and discussed, and its convergence is proved. The performance of hybrid algorithms involving global deformation and individual constraint relaxation is discussed on several practical cases.
منابع مشابه
SDO relaxation approach to fractional quadratic minimization with one quadratic constraint
In this paper, we study the problem of minimizing the ratio of two quadratic functions subject to a quadratic constraint. First we introduce a parametric equivalent of the problem. Then a bisection and a generalized Newton-based method algorithms are presented to solve it. In order to solve the quadratically constrained quadratic minimization problem within both algorithms, a semidefinite optim...
متن کاملModel-based Partitioning for MaxSAT Solving
Linear search algorithms have been shown to be particularly effective for solving partial Maximum Satisfiability (MaxSAT) problem instances. These algorithms start by adding a new relaxation variable to each soft clause and solving the resulting formula with a SAT solver. Whenever a model is found, a new constraint on the relaxation variables is added such that models with a greater or equal va...
متن کاملMixed integer-linear formulations of cumulative scheduling constraints A comparative study
This paper introduces two MILP models for the cumulative scheduling constraint and associated pre-processing filters. We compare standard solver performance for these models on three sets of problems and for two of them, where tasks have unitary resource consumption, we also compare them with two models based on a geometric placement constraint. In the experiments, the solver performance of one...
متن کاملImplementing Constraint Relaxation over FiniteDomains using Assumption - based
Many real-life Constraint Satisfaction Problems are over-constrained. In order to provide some kind of solution for such problems, this paper proposes a constraint relaxation mechanism fully integrated with the constraint solver. Such a constraint relaxation system must be able to perform two fundamental tasks: identiication of constraints to relax and eecient constraint suppression. Assumption...
متن کاملA Two-body Solver for Assembly Modelling
Assembly modelling deals with the spatial joining of rigid bodies in 3D-space for which constraint based modelling is a proven approach. The existing geometric constraint solvers do not satisfy all needs, there are still challenges for research. The two-body-problem (constraint intersection) and the three-body-problem (constraint composition) are subproblems which have exploitable properties on...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2007